منابع مشابه
Maximum likelihood supertrees.
We analyze a maximum likelihood approach for combining phylogenetic trees into a larger "supertree." This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description (as a median tree, minimizing a weighted sum of distances to the input trees). We show that this approach to ML supertree reconstruction is statistically co...
متن کاملMaximum Likelihood Supertrees Maximum Likelihood Supertrees MIKE STEEL AND ALLEN RODRIGO Author’s Affiliations
We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger ‘supertree’. This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description (as a median tree, minimising a weighted sum of distances to the input trees). We show that this approach to ML supertree reconstruction is statistically co...
متن کاملMaximum agreement and compatible supertrees
Given a collection of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists in finding a largest subset of the leaves such that all input trees restricted to this set are identical, resp. have a common refinement. For MAST, resp. MCT, on rooted trees, we give an algorithm, where and is the smallest number of leaves whose removal leads to the existence of an agreement su...
متن کاملComputing Rooted and Unrooted Maximum Consistent Supertrees
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted binary trees on three leaves, or quartets, unrooted binary trees on four leaves. We give exact algorithms constructing rooted and unrooted maximum consistent supertrees in time O(2nm log m) for a set of m triplets (qua...
متن کاملMaximum Likelihood
In this paper we discuss maximum likelihood estimation when some observations are missing in mixed graphical interaction models assuming a conditional Gaussian distribution as introduced by Lauritzen & Wermuth (1989). For the saturated case ML estimation with missing values via the EM algorithm has been proposed by Little & Schluchter (1985). We expand their results to the special restrictions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systematic Biology
سال: 2008
ISSN: 1076-836X,1063-5157
DOI: 10.1080/10635150802033014